Alternating Paths along Axis-Parallel Segments

نویسنده

  • Csaba D. Tóth
چکیده

It is shown that for a set S of n pairwise disjoint axis-parallel line segments in the plane there is a simple alternating path of length Ω( √ n). This bound is best possible in the worst case. In the special case that the n pairwise disjoint axis-parallel line segments are protruded (that is, if the intersection point of the lines through every two nonparallel segments is not visible from both segments), there is a simple alternating path of length n.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Alternating Paths along Orthogonal Segments

It was shown recently that in the segment endpoint visibility graph Vis(S) of any set S of n disjoint line segments in the plane, there is an alternating path of length (log n), and this bound best possible apart from a constant factor. This talk focuses on the variant of the problem where S is a set of n disjoint axis-parallel line segments, and shows that the length of a longest alternating p...

متن کامل

Parallel solution of model predictive control using the alternating direction multiplier method

In this work a parallel solution method for model predictive control is presented based on the alternating direction multiplier method. Our approach solves the overall problem by decomposing it along the time-axis into smaller subproblem. The resulting subproblems can be solved efficiently in parallel and are coupled by the multiplier update. We specifically considers box constraints, since thi...

متن کامل

5-axis iso-scallop tool paths along parallel planes

This paper presents a new method of computing constant scallop height tool paths in 5-axis milling. Indeed, usual iso-scallop tool path computation methods in 3-axis or 5-axis milling generate tool path self-intersections, which prevent from reaching the required quality and productivity. The proposed approach consists in following parallel planes in 5-axis milling to avoid self-intersection of...

متن کامل

A Study on Scalable Parallelism in Spider-Web Networks

Regular degree-three Spider-Web networks, SW(m,n), are optimally, scalability prototyped along transportation paths as dual-surveillance − preventing information occlusion, or reliable identity based telecommunication networks. To promote network information transmission such as coping with radio interference and multipath effects, offering dynamic authentication / authorization the performance...

متن کامل

Alternating paths through disjoint line segments

We show that every segment endpoint visibility graph on disjoint line segments in the plane admits an alternating path of length , answering a question of Bose. This bound is optimal apart from a constant factor. We also give bounds on the constants hidden by the asymptotic notation.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Graphs and Combinatorics

دوره 22  شماره 

صفحات  -

تاریخ انتشار 2006